Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(f(x)) → g(f(x))
g(g(x)) → f(x)

Q is empty.


QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(f(x)) → g(f(x))
g(g(x)) → f(x)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F(f(x)) → G(f(x))
G(g(x)) → F(x)

The TRS R consists of the following rules:

f(f(x)) → g(f(x))
g(g(x)) → f(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP
      ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

F(f(x)) → G(f(x))
G(g(x)) → F(x)

The TRS R consists of the following rules:

f(f(x)) → g(f(x))
g(g(x)) → f(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
QDP
          ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F(f(x)) → G(f(x))
G(g(x)) → F(x)

The TRS R consists of the following rules:

f(f(x)) → g(f(x))
g(g(x)) → f(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


G(g(x)) → F(x)
The remaining pairs can at least be oriented weakly.

F(f(x)) → G(f(x))
Used ordering: Combined order from the following AFS and order.
F(x1)  =  x1
f(x1)  =  f(x1)
G(x1)  =  x1
g(x1)  =  g(x1)

Lexicographic path order with status [19].
Quasi-Precedence:
[f1, g1]

Status:
f1: [1]
g1: [1]


The following usable rules [14] were oriented:

g(g(x)) → f(x)
f(f(x)) → g(f(x))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ QDPOrderProof
QDP
              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F(f(x)) → G(f(x))

The TRS R consists of the following rules:

f(f(x)) → g(f(x))
g(g(x)) → f(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.